Location:
Search - 01 knapsack
Search list
Description: 01背包问题的回溯解法 希望给大家一点帮助-01 knapsack problem the solution back to help give us some hope
Platform: |
Size: 1024 |
Author: xtp |
Hits:
Description: 使用动态规划方法解决01背包问题 比较简单的程序 -Using dynamic programming solution to 01 knapsack problem relatively simple procedure
Platform: |
Size: 141312 |
Author: smile |
Hits:
Description: 使用回溯法解决01背包问题，适合于算法分析与设计的初学者-Use backtracking to solve 01 knapsack problem, algorithm analysis and design is suitable for beginners
Platform: |
Size: 196608 |
Author: smile |
Hits:
Description: 用蛮力法，回溯法，分支限界法求解背包问题-With the brute force method, backtracking, branch and bound method for solving knapsack problem
Platform: |
Size: 1052672 |
Author: hehuiling |
Hits:
Description: 使用动态规划算法实现01背包问题，是个很好的例子哦。-Using dynamic programming algorithm 01 knapsack problem is a good example of oh.
Platform: |
Size: 1024 |
Author: 王菲菲 |
Hits:
Description: 为了方便大家更好的学习算法分析，我上传了一个用回溯法解决的01背包问题-In order to facilitate a better learning algorithm all analysis, I uploaded a backtracking method to deal with the 01 knapsack problem
Platform: |
Size: 1024 |
Author: feifei981110 |
Hits:
Description: 这是关于01背包问题的动态规划算法。采用C++语言完成的，代码间有注释。-This is about 01 knapsack problem dynamic programming algorithm. Using C++ language completed, there are comments between the code.
Platform: |
Size: 1024 |
Author: zhenhong |
Hits:
Description: 完成了01背包问题的求解，附实验报告，包括算法描述，时空效率分析还有.exe文件-Completed a 01 knapsack problem solving, with a test report, including the algorithm description, time and space efficiency analysis there. Exe files
Platform: |
Size: 96256 |
Author: 姜岩 |
Hits:
Description: 01背包问题，完全背包，以及多重背包问题的详解和源程序。-01 knapsack problem, complete backpack, and multiple knapsack problem Xiangjie and procedures.
Platform: |
Size: 67584 |
Author: caolei |
Hits:
Description: 回溯法解决01背包问题，是在标准C++上运行的代码，故在VC++上也能运行良好！-Backtracking to solve 01 knapsack problem is in the standard C++ code to run on, so the VC++ is also able to run well!
Platform: |
Size: 1024 |
Author: daisy |
Hits:
Description: 此程序是用回溯法解决01背包问题，可以运行成功，欢迎下载-This program is backtracking to solve 01 knapsack problem, you can run successfully, please download
Platform: |
Size: 1024 |
Author: 小杰 |
Hits:
Description: 01遗传算法 解决普通的背包问题，对一些复杂的问题进行修改就能解决-01 knapsack genetic algorithm to solve common problems, some complex problems can be solved changes
Platform: |
Size: 6144 |
Author: 吴学兵 |
Hits:
Description: 动态规划问题中的01背包问题，需要的可以看下了-Dynamic programming problem in the 01 knapsack problem, in need may have a look up. .
Platform: |
Size: 1024 |
Author: zhang peng |
Hits:
Description: 算法分析中以回溯法实现的01背包问题，附有完整的运行说明-Backtracking algorithm analysis in order to achieve the 01 knapsack problem, with complete operating instructions
Platform: |
Size: 1287168 |
Author: 张三 |
Hits:
Description: 算法分析与设计中的01背包问题，采用合并排序方法。-《Algorithm analysis and design》 of the 01 knapsack problem, using merge sort method.
Platform: |
Size: 903168 |
Author: |
Hits:
Description: 动态规划算法之0-1背包问题算法的实现。-Dynamic programming algorithm of 0-1 knapsack problem algorithm.
Platform: |
Size: 1024 |
Author: yangdingyi |
Hits:
Description: 01背包动态规划法的cpp文件 直接可用-01 knapsack dynamic programming
Platform: |
Size: 1024 |
Author: 荆博 |
Hits:
Description: c++， 动态规划解决01背包问题-c++, 01 knapsack problem dynamic programming to solve
Platform: |
Size: 2048 |
Author: 何林书 |
Hits:
Description: 01背包问题：给定n种物品和一个背包。物品i的重量是wi,其价值为vi,背包的容量为c.问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大。-01 knapsack problem: Given n types of items and a backpack. Item i of the weight of wi, the value of vi, c. Q backpack with a capacity of how to choose the items into the backpack, making the backpack into the largest total value of goods.
Platform: |
Size: 2048 |
Author: 苏小猫 |
Hits:
Description: 01背包问题的动态规划算法，能运行，我调好的-01 knapsack problem dynamic programming algorithm, to run, I am a good tune
Platform: |
Size: 2048 |
Author: crp0289 |
Hits: